Method for mining a block in a decentralized blockchain consensus network

ABSTRACT

A method for mining a block in a decentralized blockchain consensus network (DBCN) includes sending, by a mining computing entity (MCE), a signing request for mining a new block of a blockchain to a trusted execution environment computing entity (TEE-CE), the signing request including block information, the block information including block height information, and comparing, by the TEE-CE, the block height information of the signing request with block height information from a last signing request and providing a matching, when the difference between the block height information of the signing request and the block height information from the last signing request satisfies a defined value. The method further comprises, upon providing the matching, signing, by the TEE-CE, the new block based on the block information, and providing, by the MCE, the new signed block to the DBCN.

CROSS REFERENCE TO RELATED APPLICATIONS

This application is a U.S. National Stage Application under 35 U.S.C. §371 of International Application No. PCT/EP2017/054416 filed on Feb. 24,2017. The International Application was published in English on Aug. 30,2018, as WO 2018/153485 A1 under PCT Article 21(2).

FIELD

The present invention relates to a method for mining a block in adecentralized blockchain consensus network by a mining computing entity,‘MCE’.

The present invention further relates to a decentralized block chainconsensus network, comprising a plurality of node computing entities, atleast one mining computing entity, ‘MCE’, and trusted environmentexecution computing entity, ‘TEE-CE’.

The present invention further relates to a mining computing entity,‘MCE’, for mining a transaction in a decentralized blockchain consensusnetwork.

The present invention further relates to a method for mining a block ina decentralized blockchain consensus network by a mining computingentity, ‘MCE’.

The present invention even further relates to a trusted executionenvironment computing entity, ‘TEE-CE’ for signing a block of ablockchain in a decentralized blockchain consensus network.

The present invention even further relates to a method for signing ablock of a blockchain by a trusted execution environment computingentity, ‘TEE-CE’.

The present invention even further relates to a non-transitory computerreadable medium storing a program causing a computer to execute a methodfor mining a block in a decentralized blockchain consensus network by amining computing entity, ‘MCE’.

The present invention even further relates to non-transitory computerreadable medium storing a program causing a computer to execute a methodfor mining a block in a decentralized blockchain consensus network.

The present invention further relates to non-transitory computerreadable medium storing a program causing a computer to execute a methodfor signing a block of a blockchain.

BACKGROUND

Proof-of-works are getting more and more important in informationtechnology security. For example crypto-currencies like Bitcoin rely onproof-of-works to thwart the overproduction.

Bitcoin is a decentralized payment system and is currently gainingpopularity as a digital currency; several businesses are starting toaccept Bitcoin transactions. For instance, Bitcoins were used as a formof fast payment in a local fast-food restaurant.

Bitcoin is a Proof-of-Work (POW) based currency that allows users to“mine” for digital coins by performing computations. Users executepayments by digitally signing their transactions and are prevented fromdouble-spending their coins (i.e., signing-over the same coin to twodifferent users) through a distributed time-stamping service. Thisservice operates on top of the Bitcoin Peer-to-Peer (P2P) network thatensures that all transactions and their order of execution are availableto all Bitcoin users.

Bitcoin is increasingly used in a number of “fast payment” scenarios,where the exchange time between the currency and goods is short.Examples include online services, ATM withdrawals, vending machinepayments and fast-food payments, where the payment is followed by fast(<30 seconds) delivery of goods. While Bitcoin PoW-based time-stampingmechanism is appropriate for slow payments (e.g., on-line orders withdelivery of physical goods), it requires tens of minutes to confirm atransaction and is therefore inappropriate for fast payments. Thismechanism is, however, essential for the detection of double-spendingattacks—in which an adversary attempts to use some of her coins for twoor more payments. Since Bitcoin users are anonymous and users (areencouraged to) hold many accounts, there is only limited value inverifying the payment after the user obtained the goods (and e.g., leftthe store) or services (e.g., access to on-line content).

Double-spending attacks may be launched in particular during a temporaryfork until the Bitcoin network merges the forks and agrees on the totalorder of transactions.

At present, blockchain forking is the one of the main challenges fordistributed consensus. It slows down the time for the network to reachconsensus and reduces the efficiency of the system.

The original conventional Proof-of-Work consensus protocol or miningprotocol as disclosed in the non-patent literature of Gervais, A.,Karame, G. et al, “On the Security and Performance of Proof of WorkBlockchains, available under https://eprintiacr.org/2016/555.pdf wascriticized for its waste of energy for mining (as disclosed in thenon-patent literature of Karame, Androulaki, & Capkun, 2012,Double-Spending Attacks on Fast Payments in Bitcoin. Proceedings of theACM Conference on Computer and Communications Security (CCS). Chicago,Ill., USA), miners have to invest computation resources to repeatedlyperform hashing functions until the right parameters are found to makethe block legitimate. Therefore, a further conventional blockchain wasproposed using multiple virtual mining protocols such as Proof-of-StakePoS and Proof-of-Elapsed-Time PoET. Instead of brute-forcing the nextblock with computation resources, a node here uses his virtual miningresources such as stakes PoS or random timer returned by its securehardware PoET to mine the next block. However, since the mining processcomes without much cost, the main risk in virtual mining isnothing-at-stake, i.e., a node that can mine multiple blocks at the sametime in order to increase its chance among all miners so that one of itsblocks will be finally included in the blockchain and thus gaining thereward. Consequently, mining multiple blocks can create multiple forksin the system, and nodes can in turn work on multiple forks (branches)at the same time, thus increasing the number of forks in the systemexponentially, which will considerably slow down the consensus speed andincrease the risk of double-spending.

Some conventional methods, e.g. disclosed in the non-patent literatureof Buterin, V. (2014, January) Slasher: A Punitive Proof-of-StakeAlgorithm, available underhttps://blog.ethereum.org/2014/01/15/slasher-a-punitive-proof-of-stake-algorithm/involve penalizing miners if they simultaneously create blocks onmultiple forks or voting on the “wrong” fork. This is done by holdingsome deposit of the miners for a period and allowing the reclamationonly if no misbehaviour is detected and reported. For example, Slasher1.0 as disclosed herein delays the reward claiming by locking the rewardfor some number of blocks. The reward and possibly some deposit can bedestroyed whenever the misbehaviour is detected and is included in theblockchain before the claiming point.

SUMMARY

In an embodiment, the present invention provides a method for mining ablock in a decentralized blockchain consensus network (DBCN). The methodcomprising sending by a mining computing entity (MCE), a signing requestfor mining a new block of a blockchain to a trusted executionenvironment computing entity (TEE-CE), the signing request includingblock information, the block information including block heightinformation, and comparing, by the TEE-CE, the block height informationof the signing request with block height information from a last signingrequest and providing a matching, when the difference between the blockheight information of the signing request and the block heightinformation from the last signing request satisfies a defined value. Themethod further comprises, upon providing the matching, signing, by theTEE-CE, the new block based on the block information, and providing, bythe MCE, the new signed block to the DBCN.

BRIEF DESCRIPTION OF THE DRAWINGS

The present invention will be described in even greater detail belowbased on the exemplary figures. The invention is not limited to theexemplary embodiments. All features described and/or illustrated hereincan be used alone or combined in different combinations in embodimentsof the invention. The features and advantages of various embodiments ofthe present invention will become apparent by reading the followingdetailed description with reference to the attached drawings whichillustrate the following:

FIG. 1 shows steps of a method according to an embodiment of the presentinvention;

FIG. 2 shows more detailed steps of a method according to an embodimentof the present invention;

FIG. 3 shows more detailed steps of a method according to a furtherembodiment of the present invention;

FIG. 4 shows steps of a method according to an embodiment of the presentinvention;

FIG. 5 shows steps of a method according to an embodiment of the presentinvention; and

FIG. 6 shows steps of a method according to an embodiment of the presentinvention.

DETAILED DESCRIPTION

The conventional methods described above only add disincentives butcannot completely prevent misbehaviour. Namely, they may only stopopportunistic attacks, but not those targeted attacks that intend tomanipulate the transactions. This is the case since these conventionalmethods only cost the malicious nodes losing their deposits or rewardswhich in some cases comparing to what they can gain, e.g., double-spendsome transactions that involves huge amount of stake or transactionswith important assets.

Embodiments of the present invention prevent intentional forks in theblockchain caused by miners generating conflicting blocks. Embodimentsof the present invention stop not only opportunistic attacks but attacksintending to manipulate transactions. Embodiments of the presentinvention also enhance security, to at least reduce double spendingattacks and to increase the efficiency of the system.

In an embodiment, the present invention provides a method for mining ablock in a decentralized blockchain consensus network ‘DBCN’, saidmethod comprising the steps of:

-   -   a) Sending by a mining computing entity, ‘MCE’, a signing        request for mining a new block of a blockchain to a trusted        execution environment computing entity, ‘TEE-CE’, said signing        request including block information, said block information        including block height information,    -   b) Comparing, by the TEE-CE, the block height information of the        signing request with the block height information from the last        signing request and providing a matching, when the difference        between said two block height information satisfies a defined        value    -   c) Upon matching, signing, by said TEE-CE the new block based on        the block information, and    -   d) Providing, by said MCE, the new signed block to said DBCN.

In a further embodiment the present invention provides a decentralizedblockchain consensus network, ‘DBCN’, comprising a plurality of nodecomputing entities, at least one mining computing entity, ‘MCE’, and atrusted environment execution computing entity, ‘TEE-CE’, said MCE beingadapted to:

-   -   i. Send a signing request for mining a new block of a blockchain        to said TEE-CE, said signing request including block        information, said block information including block height        information,    -   ii. Receive, upon successful matching, the signed new block        based on the block information from said TEE-CE, and to    -   iii. Provide the new signed block to at least one node computing        entity in said DBCN and said TEE-CE being adapted to        -   A) Receive, from said MCE, a signing request for mining a            new block of a blockchain, said signing request including            block information, said block information including block            height information        -   B) Compare the block height information of the received            signing request with the block height information from the            last signing request and        -   C) Provide a matching, when the difference between said two            block height information satisfies a defined value,        -   D) Sign the new block based on the block information upon            matching, and to        -   E) Send the signed new block to said MCE.

In a further embodiment the present invention provides a miningcomputing entity, ‘MCE’ for mining a block in a decentralized blockchainconsensus network, ‘DBCN’, adapted to:

-   -   i. Send a signing request for mining a new block of a blockchain        to a trusted execution environment computing entity, ‘TEE-CE’,        said signing request including block information, said block        information including block height information    -   ii. Receive, upon successful matching, the signed new block        based on the block information from the TEE-CE, and to    -   iii. Provide the new signed block to said DBCN.

In a further embodiment the present invention provides a method formining a block in a decentralized blockchain consensus network, ‘DBCN’,by a mining computing entity, ‘MCE’, comprising the steps of:

-   -   i. Sending a signing request for mining a new block of a        blockchain to a trusted execution environment computing entity,        ‘TEE-CE’, said signing request including block information, said        block information including block height information    -   ii. Receiving, upon successful matching, the signed new block        based on the block information from the TEE-CE, and    -   iii. Providing the new signed block to said DBCN.

In a further embodiment the present invention provides a trustedexecution environment computing entity, ‘TEE-CE’, for signing a block ofa blockchain in a decentralized blockchain consensus network, ‘DBCN’,adapted to:

-   -   A) Receive, from a mining computing entity, ‘MCE’, a signing        request for mining a new block of a blockchain, said signing        request including block information, said block information        including block height information    -   B) Compare the block height information of the received signing        request with the block height information from the last signing        request and    -   C) Provide a matching, when the difference between said two        block height information satisfies a defined value,    -   D) Sign the new block based on the block information upon        matching, and to    -   E) Send the signed new block to said MCE.

In a further embodiment the present invention provides a method forsigning a block of a blockchain by a trusted execution environmentcomputing entity, ‘TEE-CE’, comprising the steps of:

-   -   A) Receiving, from a mining computing entity, ‘MCE’, a signing        request for mining a new block of a blockchain, said signing        request including block information, said block information        including block height information    -   B) Comparing the block height information of the received        signing request with the block height information from the last        signing request and    -   C) Providing a matching, when the difference between said two        block height information satisfies a defined value,    -   D) Signing the new block based on the block information upon        matching, and    -   E) Sending the signed new block to said MCE.

In a further embodiment the present invention provides a non-transitorycomputer readable medium storing a program causing a computer to executea method for mining a block in a decentralized blockchain consensusnetwork, ‘DBCN’, said method comprising the steps of:

-   -   a) Sending by computing entity ‘MCE’, a signing request for        mining a new block of a blockchain to a trusted execution        environment computing entity, ‘TEE-CE’, said signing request        including block information, said block information including        block height information,    -   b) Comparing, by the TEE-CE, the block height information of the        signing request with the block height information from the last        signing request and providing a matching, when the difference        between said two block height information satisfies a defined        value    -   c) Upon matching, signing, by said TEE-CE the new block based on        the block information, and    -   d) Providing the new signed block to said DBCN.

In a further embodiment the present invention provides a non-transitorycomputer readable medium storing a program causing a computer to executea method for mining a block in a decentralized blockchain consensusnetwork, ‘DBCN’, comprising the steps of:

-   -   i. Sending by a mining computing entity, ‘MCE’, a signing        request for mining a new block of a blockchain to a trusted        execution environment computing entity, ‘TEE-CE’, said signing        request including block information, said block information        including block height information    -   ii. Receiving, upon successful matching, the signed new block        based on the block information from the TEE-CE, and    -   iii. Providing the new signed block to said DBCN.

In a further embodiment the present invention provides a non-transitorycomputer readable medium storing a program causing a computer to executea method for signing a block of a blockchain, comprising the steps of:

-   -   A) Receiving, from a mining computing entity, ‘MCE’, a signing        request for mining a new block of a blockchain, said signing        request including block information, said block information        including block height information    -   B) Comparing the block height information of the received        signing request with the block height information from the last        signing request and    -   C) Providing a matching, when the difference between said two        block height information satisfies a defined value,    -   D) Signing the new block based on the block information upon        matching, and    -   E) Sending the signed new block to said MCE.

In other words the present invention enables a secure virtual mining forpermission-less blockchains using secure hardware, in particular bybinding a height block information to the block signature.

At least one embodiment of the present invention may have the advantageof at least significantly reducing, in particular even completelypreventing, intentional forks in the blockchain network. At least oneembodiment of the present invention may have the advantage of notrelying on reputation systems on the one hand and on the other hand ofnot requiring an identity manager in the blockchain network. At leastone embodiment of the present invention may have the further advantageof increasing the efficiency of the computational resources of theblockchain network and increasing the security in the blockchainnetwork.

The term “computer readable medium” may refer to any kind of medium,which can be used together with a computation device or computer and onwhich information can be stored. Said information may be any kind ofdata which can be read into a memory of a computer. For example saidinformation may include program code for executing with said computer.Examples of a computer readable medium are tapes, CD-ROMs, DVD-ROMs,DVD-RAMs, DVD-RWs, BluRay, DAT, MiniDisk, solid state disks SSD, floppydisks, SD-cards, CF-cards, memory-sticks, USB-sticks, EPROM. EEPROM orthe like.

The terms “computing entity” and “computing device” may refer inparticular in the claims, preferably in the specification each to adevice adapted to perform computing like a personal computer, a tablet,a mobile phone, a server, or the like and comprises one or moreprocessors having one or more cores and may be connectable to a memoryfor storing one or more applications which is/are adapted to performcorresponding steps of one or more of the embodiments of the presentinvention. Any application may be software-based and/or hardware-basedinstalled in the memory on which the processor(s) can work on. Thedevices, entities or the like may be adapted in such a way that thecorresponding steps to be computed are performed in an optimized way.For instance different steps may be performed in parallel with a singleprocessor on different of its cores. Further the entity/device may beidentical forming a single computing device. The device(s)/entity(ies)may also be instantiated as a virtual device running on a physicalcomputing resource. Different devices/entities may therefore be executedon said physical computing resource.

The term “computational resource” may be understood in its broadestsense and may refer in particular in the claims, preferably in thespecification to any kind of physical and/or virtual computational orcompute resource, resource, device, entity or the like adapted toperform computing and which can be used by applications, services,users, etc. to perform certain functions, services, applications or thelike. A computational resource may include but is not limited tocomputes, networks, memories, storages, etc. For instance a computeresource may be a CPU resource that is part of the servers inside thedatacenter. Thus a server can have Compute like CPU (or vCPU), Networklike Network Interface card (NIC), Memory like RAM and/or Storage likeexternal/internal HDD(s).

The term “decentralized blockchain consensus network” may be understoodin the most general sense and may refer in particular in the claims,preferably in the specification to a network having a plurality of nodesproviding decentralized storage among said participating nodes in thenetwork. Each node has preferably a copy either a light version or afull version of the chain of blocks, wherein each block may be a closedledger to agree universally on the data status.

The term “blockchain” may be understood, in particular in the claims,preferably in the description as a distributed database maintaining acontinuously growing list of data records that are hardened againsttampering and revision even by operators of the data storing nodeshosting database. A blockchain comprises for example two kinds ofrecords: so-called transactions and so-called blocks. Transactions maybe the actual data to be stored in the blockchain and blocks may berecords confirming when and in what sequence certain transactions becamejournaled as a part of the blockchain database. Transactions may becreated by participants and blocks may be created by users who may usespecialized software or equipment designed specifically to createblocks. The term “blockchain” is e.g. identical to the Bitcoinblockchain as a digital currency was introduced in 2008.

The term “mining” with regard to a “block” may be understood in the mostgeneral sense and may refer in particular in the claims, preferably inthe specification to a distributed computational review processperformed on each “block” of data in a “blockchain”. This allows forachievement of consensus in an environment where neither party knows ortrusts each other. “Mining” is performed by a “miner”.

The term “miner” may be understood in the most general sense and mayrefer in particular in the claims, preferably in the specification to anindividual, person, user or the like who runs a computing entity torepeatedly calculate hashes with the intention to create a successfulblock and to earn coins from transaction fees and new coins created withthe block itself.

The term “block information” may be understood in the most general senseand may refer in particular in the claims, preferably in thespecification to information related, describing or specifyinginformation of properties of a block of a blockchain.

The term “block height information” may be understood in the mostgeneral sense and may refer in particular in the claims, preferably inthe specification to information related to, describing or specifyingthe height of a block of a blockchain.

The term “missing block information” may be understood in the mostgeneral sense and may refer in particular in the claims, preferably inthe specification to information related to, describing or specifying ablock which has been already confirmed by the blockchain network, butwhich has not been updated yet in a computing entity for performingsigning.

The term “confirmed” with regard to a block of a blockchain may beunderstood in the most general sense and may refer in particular in theclaims, preferably in the specification to a block which has alreadybeen included in the blockchain or—the other way round—the term“unconfirmed” means that a block has not yet been included in theblockchain, and is still reversible.

The term “signing request” may be understood in the most general senseand may refer in particular in the claims, preferably in thespecification to a message, transmission, etc. comprising informationfor initiating a signing of data, information or the like. Theinformation to be signed may be included in said signing request.

The term “last” with regard to the term “signing request” may beunderstood in the most general sense and may refer in particular in theclaims, preferably in the specification to the most actual signingrequest already processed by the receiving entity and received prior toreceiving another new signing request.

The term “matching” may be understood in the most general sense and mayrefer in particular in the claims, preferably in the specification to asuccessful comparison between at least two values of parameters or thelike.

Further features, advantages and further embodiments are described ormay become apparent in the following:

Said signing request may further include missing block information, saidmissing block information including confirmed blocks which have not beenupdated yet in said TEE-CE. This enables to further restrict the node toonly work on one fork, that means a miner works only one fork at a time.

Said defined value may be set on at least one of: the value 1, thenumber of missing blocks, the sum of 1 and the number of missing blocks.This allows an easy way to check the number of missing blocks.

Signing according to c) may be further based on a, preferablyaccumulated, hash of the missing block information. This enables in aneasy way to include information about the fork into the block signaturein order that all nodes can verify it. The accumulated hash ensures thatonce chosen a branch, a node cannot exclude an already confirmed blockin that branch.

The new block may be provided to the blockchain network by broadcasting.This enables in an easy way to distribute the new block among allparticipating node computing entities.

The TEE-CE may be provided as integral part of the MCE. This enablesfaster processing of signing by the corresponding mining computingentity in case the MCE has its own TEE-CE component.

In the following FIGS. 1-6 a public blockchain model is assumed. Theblockchain network comprises a plurality of distributed nodes, who run aclient application for peer-to-peer connection(s). The transactions arebroadcasted into the blockchain network for public validation; eachmining node then organizes the validated transactions into blocks, andmines the next legitimate block to be included into the blockchain. Themining protocol, which is executed by all miners and validated by allnodes, brings consensus to the transaction history in this distributedsystem. Miners may join and leave at any time in the process.

FIG. 1 shows a blockchain network with miners and non-miners. Thecurrent length of the block chain is 3, minor number one has just minednew block of the blockchain.

Further it is assumed that all nodes joining the blockchain network areequipped with secure hardware for providing a trusted executionenvironment. The certificates of all secure hardware can be verified byall other nodes given vendor's signature.

Each node has to use the registered credential to sign each mined blockand the signature will be used as one of the factors of whether the nodebecomes a legitimate validator of the next block. Meanwhile, the securehardware will track the block height information during the signingprocess. For example, in the signing request, the block height number isincluded in the block. The register of the secure hardware, such as amonotonic counter, will record this height number of the block that wasjust signed. If in the next signing request the input block heightinformation is not monotonic, the secure hardware will reject to signthe block.

The following protocol describes the interface calls between the blockmining process (miner) and the secure hardware (TEE):

miner_(i) → TEE: SIGN_REQ (block_info), where block_info =<transactions, previous_block, block_height, . . . > TEE: if Reg_(last)_(—) _(height) < block_height, Reg_(last) _(—) _(height) = block_height.TEE → miner_(i): sig_(i) = Sign_(SKi)(block_info) miner_(i): check ifthe new block is successfully mined: Verify(time, block_chain,new_block_(i), account_(i), sig_(i), . . .); if true broadcastsnew_block_(i). All miners: if Verify(time, block_chain, new_block_(i),account_(i), sig_(i), . . . ) is true, save new_block_(i) to the localledger and further broadcast it.

An example flow diagram for the interaction between the miner and itssecure hardware is given in FIG. 2. FIG. 2 shows more detailed steps ofmethod according to an embodiment of the present invention. In FIG. 2interaction steps between the miner process and secure hardware TEE isshown to get the signature of the block that the node is mining: In thefirst step the miner process sends a signing request to its TEEcomprising block information and the height of the block being equal to4. The TEE detects that the height of the block for signing isincremental since the previous block height was equal to 3 and sets itto 4. The TEE signs the block and sends it back to the miner process.The miner process checks if the block is successfully mined and if yesthe new block is broadcast into the blockchain is network.

The above mentioned protocol or steps respectively ensure that a mineronly has one chance to try generating a block at a certain height andcan manage to generate at most one block at a certain height of allpossible forks in the system. Although it does not restrict the miner toonly work on one particular fork, a miner may initially work on thewrong fork and can switch to work on another fork later on. But it doesguarantee that a miner can work on only one fork at a time, thuspreventing nothing-at-stake.

FIG. 3 shows more detailed steps of method according to a furtherembodiment of the present invention. A misbehaved node mining on twobranches that forks at block height=4. It is assumed that the blocks areimmediately confirmed. Other miners cannot find a fork that matches thesigned accumulated hash Hfork and thus will reject the new block. Tofurther restrict the node to only work on one fork which supposes that acorrect node is working on the correct fork (branch) from the beginninglike e.g. Slash 2.0, the embodiment of FIG. 2 can be extended to includealso the identity of the fork branch which is shown here in FIG. 3. Theembodiment of FIG. 3 uses an accumulated hash over all the confirmed(according to Proof-of-Stake PoS) blocks to identify the fork that themining node is working on and includes this fork information into theblock signature, in order that all nodes can verify it. The accumulatedhash in the secure hardware ensures that once chosen a branch, a nodecannot exclude an already confirmed block in that branch.

The extended protocol of FIG. 3 works as follows:

miner_(i) -> TEE: SIGN_REQ (block_info, <missing_blocks>), whereblock_info = <transactions, previous_block, block_height, . . . >, and<missing_blocks> contains all the previous blocks that are confirmed butnot updated in the TEE since the last SIGN_REQ call. TEE: if Reg_(last)_(—) _(height) < block_height, Reg_(last) _(—) _(height) = block_height;and for each missing block j in the missing block list: h_(accum) _(—)_(hash) = H(h_(accum) _(—) _(hash), missing_block_(j)). FinallyReg_(fork) = h_(accum) _(—) _(hash) TEE -> miner_(i): sig_(i) =Sign_(SKi)(block_info, Reg_(fork)) miner_(i): check if the new block issuccessfully mined: Verify(time, block_chain, new_block_(i),account_(i), sig_(i), . . . ); if true broadcasts new_block_(i). Verify() retrieves the fork from the previous_block information and comparesthe accumulated hash over the blocks until the current block height.

In FIG. 3 interaction steps between a miner process and a securehardware TEE is shown to get the signature of the block that the node ismining: In the first step the miner process sends a signing request toits TEE comprising block information and the height of the block beingequal to 5 together with two missing blocks, here block 3 and block 4.The TEE detects that the height of the block for signing is incrementalsince the previous block height was equal to 2 and sets it to 5considering the two missing blocks and computes an accumulated hash withthe fork hash and the hashes of the missing blocks. The TEE signs theblock based on the accumulated fork hash and sends it back to the minerprocess. The miner process checks if the block is successfully mined andif yes the new block is broadcast into the blockchain network. If thefork is incorrect for a new block to be signed, other miners cannot finda fork matching the signed accumulated hash and they will reject the newsigned block.

FIG. 4 shows steps of a method according to an embodiment of the presentinvention. In FIG. 4 a method for mining a block in a decentralizedblockchain consensus network, ‘DBCN’, is shown, said method comprisingthe steps of:

-   -   a) Sending by a mining computing entity, ‘MCE’, a signing        request for mining a new block of a blockchain to a trusted        execution environment computing entity, ‘TEE-CE’, said signing        request including block information, said block information        including block height information,    -   b) Comparing, by the TEE-CE, the block height information of the        signing request with the block height information from the last        signing request and providing a matching, when the difference        between said two block height information satisfies a defined        value    -   c) Upon matching, signing, by said TEE-CE the new block based on        the block information    -   d) Saving the block height information of the signed block in a        replay-attack-resistant memory by said TEE-CE and    -   e) Providing, by said MCE, the new signed block to said DBCN.

FIG. 5 shows steps of a method according to an embodiment of the presentinvention. In FIG. 5 a method for mining a block in a decentralizedblockchain consensus network, ‘DBCN’, by a mining computing entity,‘MCE’ is shown, comprising the steps of:

-   -   i. Sending a signing request for mining a new block of a        blockchain to a trusted execution environment computing entity,        ‘TEE-CE’, said signing request including block information, said        block information including block height information    -   ii. Receiving, upon successful matching, the signed new block        based on the block information from the TEE-CE, and    -   iii. Providing the new signed block to said DBCN.

FIG. 6 shows steps of a method according to an embodiment of the presentinvention. In FIG. 6 a method for mining a trusted execution environmentcomputing entity, ‘TEE-CE’, for signing a block of a blockchain in adecentralized blockchain consensus network, ‘DBCN’, adapted to:

-   -   A) Receive, from a mining computing entity, ‘MCE’, a signing        request for mining a new block of a blockchain, said signing        request including block information, said block information        including block height information    -   B) Compare the block height information of the received signing        request with the block height information from the last signing        request and    -   C) Provide a matching, when the difference between said two        block height information satisfies a defined value,    -   D) Sign the new block based on the block information upon        matching,    -   E) Saving the block height information of the signed block in a        replay-attack-resistant memory by said TEE-CE and to    -   F) Send the signed new block to said MCE.

In a further embodiment the present invention provides a methodcomprising the steps of:

-   1) A node forwards the block signing request to the secure hardware,    where the block information includes the block height.-   2) Said node's secure hardware compares the block height in the    request with the value stored from the last signing request. If the    height is incremental, the secure hardware returns the signature and    updates the block height.-   3) The new block is broadcasted to the network and all nodes    validate the new block according to the consensus protocol, where at    least the signature of the block affects the validation outcome.

In summary, one or more embodiments of the present invention may provideor enable:

-   1) A signing of the outcome of virtual mining using Trusted    Execution Environment (TEE)-based private keys and ensuring one    signature per block height by the TEE; and/or-   2) Including the summary of all previously confirmed blocks in the    signature of the outcome of virtual mining and preventing miners    from switching forks.

One or more embodiments of the present invention reduce or preventmisbehaving nodes from performing an attack by leveraging securehardware for block signing process which validates the block heightbefore generating the signature.

Conventional methods for virtual mining may only stop opportunisticattacks, but not those targeted attacks that intend to manipulate thetransactions. This is the case since these conventional methods onlycost the malicious nodes losing their deposits or rewards, which in somecases comparing to what they can gain, e.g., double-spend sometransactions that involves huge amount of stake or transactions withimportant assets.

While the invention has been illustrated and described in detail in thedrawings and foregoing description, such illustration and descriptionare to be considered illustrative or exemplary and not restrictive. Itwill be understood that changes and modifications may be made by thoseof ordinary skill within the scope of the following claims. Inparticular, the present invention covers further embodiments with anycombination of features from different embodiments described above andbelow.

The terms used in the claims should be construed to have the broadestreasonable interpretation consistent with the foregoing description. Forexample, the use of the article “a” or “the” in introducing an elementshould not be interpreted as being exclusive of a plurality of elements.Likewise, the recitation of “or” should be interpreted as beinginclusive, such that the recitation of “A or B” is not exclusive of “Aand B,” unless it is clear from the context or the foregoing descriptionthat only one of A and B is intended. Further, the recitation of “atleast one of A, B and C” should be interpreted as one or more of a groupof elements consisting of A, B and C, and should not be interpreted asrequiring at least one of each of the listed elements A, B and C,regardless of whether A, B and C are related as categories or otherwise.Moreover, the recitation of “A, B and/or C” or “at least one of A, B orC” should be interpreted as including any singular entity from thelisted elements, e.g., A, any subset from the listed elements, e.g., Aand B, or the entire list of elements A, B and C.

1: A method for mining a block in a decentralized blockchain consensusnetwork (DBCN), the method comprising: a) sending by a mining computingentity (MCE), a signing request for mining a new block of a blockchainto a trusted execution environment computing entity (TEE-CE), thesigning request including block information, the block informationincluding block height information, b) comparing, by the TEE-CE, theblock height information of the signing request with block heightinformation from a last signing request and providing a matching, whenthe difference between the block height information of the signingrequest and the block height information from the last signing requestsatisfies a defined value, c) upon providing the matching, signing, bythe TEE-CE, the new block based on the block information, and d)providing, by the MCE, the new signed block to the DBCN. 2: The methodaccording to claim 1, wherein the signing request further includesmissing block information, the missing block information includingconfirmed blocks which have not been updated yet in the TEE-CE. 3-6:(canceled) 7: A decentralized blockchain consensus network, comprising:a plurality of node computing entities, at least one mining computingentity (MCE), and a trusted environment execution computing entity(TEE-CE), wherein the MCE is configured to: i. send a signing requestfor mining a new block of a blockchain to the TEE-CE, the signingrequest including block information, the block information includingblock height information, ii. receive, upon successful matching, thesigned new block based on the block information from the TEE-CE, andiii. provide the new signed block to at least one node computing entityin the DBCN, and wherein the TEE-CE being adapted to: A) receive, fromthe MCE, a signing request for mining a new block of a blockchain, thesigning request including block information, the block informationincluding block height information, B) compare the block heightinformation of the received signing request with the block heightinformation from a last signing request, C) provide a matching, when adifference between the block height information of the received signingrequest and the block height information from the last signing requestsatisfies a defined value, D) sign the new block based on the blockinformation upon providing the matching, and E) send the signed newblock to the MCE. 8: A mining computing entity (MCE) for mining a blockin a decentralized blockchain consensus network (DBCN), the MCE beingconfigured to: i. send a signing request for mining a new block of ablockchain to a trusted execution environment computing entity (TEE-CE),the signing request including block information, the block informationincluding block height information; ii. receive, upon successfulmatching, the signed new block based on the block information from theTEE-CE, and iii. provide the new signed block to the DBCN. 9: The MCEaccording to claim 8, the MCE comprising the TEE-CE. 10: A method formining a block in a decentralized blockchain consensus network (DBCN) bya mining computing entity (MCE), the method comprising: i. sending asigning request for mining a new block of a blockchain to a trustedexecution environment computing entity (TEE-CE), the signing requestincluding block information, the block information including blockheight information, ii. receiving, upon successful matching, the signednew block based on the block information from the TEE-CE, and iii.providing the new signed block to the DBCN. 11: A trusted executionenvironment computing entity (TEE-CE), for signing a block of ablockchain in a decentralized blockchain consensus network (DBCN), theTEE-CE being configured to: A) receive, from a mining computing entity(MCE), a signing request for mining a new block of a blockchain, thesigning request including block information, the block informationincluding block height information, B) compare the block heightinformation of the received signing request with the block heightinformation from a last signing request, C) provide a matching, when adifference between the block height information of the received signingrequest and the block height information from the last signing requestsatisfies a defined value, D) sign the new block based on the blockinformation upon providing the matching, and E) send the signed newblock to the MCE. 12: A method for signing a block of a blockchain by atrusted execution environment computing entity (TEE-CE), comprising thesteps of: A) receiving, from a mining computing entity (MCE), a signingrequest for mining a new block of a blockchain, the signing requestincluding block information, the block information including blockheight information, B) comparing the block height information of thereceived signing request with the block height information from a lastsigning request, C) providing a matching, when the difference betweenthe block height information of the received signing request and theblock height information from the last signing request satisfies adefined value, D) signing the new block based on the block informationupon matching, and E) sending the signed new block to the MCE. 13: Anon-transitory computer readable medium storing a program causing acomputer to execute a method for mining a block in a decentralizedblockchain consensus network (DBCN), the method comprising: a) sending,by computing entity, a signing request for mining a new block of ablockchain to a trusted execution environment computing entity (TEE-CE,the signing request including block information, the block informationincluding block height information, b) comparing, by the TEE-CE, theblock height information of the signing request with the block heightinformation from a last signing request and providing a matching, when adifference between the block height information of the received signingrequest and the block height information from the last signing requestsatisfies a defined value, c) upon matching, signing, by the TEE-CE thenew block based on the block information, and d) providing the newsigned block to the DBCN. 14: A non-transitory computer readable mediumstoring a program causing a computer to execute a method for mining ablock in a decentralized blockchain consensus network (DBCN), the methodcomprising: i. sending by a mining computing entity (MCE), a signingrequest for mining a new block of a blockchain to a trusted executionenvironment computing entity (TEE-CE), the signing request includingblock information, the block information including block heightinformation, ii. receiving, upon successful matching, the signed newblock based on the block information from the TEE-CE, and iii. providingthe new signed block to the DBCN. 15: A non-transitory computer readablemedium storing a program causing a computer to execute a method forsigning a block of a blockchain, the method comprising: A) receiving,from a mining computing entity (MCE), a signing request for mining a newblock of a blockchain, the signing request including block information,the block information including block height information; B) comparingthe block height information of the received signing request with blockheight information from a last signing request; C) providing a matching,when a difference between the block height information of the receivedsigning request and the block height information from the last signingrequest satisfies a defined value; D) signing the new block based on theblock information upon matching; and E) sending the signed new block tothe MCE. 16: The method according to claim 1, wherein the defined valueis set on at least one of: the value 1, a number of missing blocks, asum of 1 and the number of missing blocks. 17: The method according toclaim 2, wherein signing according to c) is further based on a hash ofthe missing block information. 18: The method according to claim 1,wherein the new block is provided to the network by broadcasting. 19:The method according to claim 1, wherein the TEE-CE is provided as anintegral part of the MCE.